Normal Forms in Combinatory Logic
نویسندگان
چکیده
منابع مشابه
Normal Forms in Combinatory Logic
Let R be a convergent term rewriting system, and let CR-equality on (simply typed) combinatory logic terms be the equality induced by βηRequality on terms of the (simply typed) lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates CR-equality a...
متن کاملRAPPORT Completing partial combinatory algebras with unique head - normal forms
In this note, we prove that having unique head-normal forms is a suucient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
متن کاملCompleting Partial Combinatory Algebras With Unique Head-Normal Forms
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
متن کاملNormal Forms for Defeasible Logic
Defeasible logic is an important logic-programming based nonmonotonic reasoning formalism which has an eecient implementation. It makes use of facts, strict rules, defeasible rules, defeaters, and a superiority relation. Representation results are important because they can help the assimilation of a concept by connning attention to its critical aspects. In this paper we derive some representat...
متن کاملDescription Logic Programs: Normal Forms
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms – namely Description Logics (DLs) and Logic Programming – are the two most successful approaches. A study of their exact relationships is thus paramount....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1994
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1040408614